Perfect Privacy for Webmail with Secret Sharing

نویسنده

  • Yossef Oren
چکیده

With the many advantages of web-based mail comes a very serious privacy flaw – all messages are stored in a single central location on the webmail operator’s data center. This fact makes these data centers a natural interception point for various undesirable parties, severely risking the privacy of individual webmail users. We propose a novel and unique way to solve this problem and protect the privacy of messages exchanged by webmail users, based on the cryptographic principle of secret sharing. Briefly put, each message is split into two shares and these shares are sent through two different webmail providers, preferably hosted in two mutually distrustful countries. While the legitimate recipient can retrieve and combine all shares of the message, a malicious party with access to only a single data center will not be able to extract any meaningful information about the message. Our scheme has a major usability advantage when compared to conventional public-key cryptography on webmail – secret sharing requires no key generation, certification or storage, and its underlying principles can be easily explained to the layman. This lets our scheme require very little in the way of user configuration or education. In addition, since our scheme does not rely on secret cryptographic keys or locally installed software, it can be used simply and easily from anywhere, a usage model consonant with the character of webmail systems. We present our scheme both in theory and as a working downloadable tool. We also discuss how to stay compatible with law enforcement and how to cope with potentially hostile webmail operators, presenting an efficient lightweight form of linguistic steganography based on Huffman encoding of Markov graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partage de secret et théorie algorithmique de l’information

Secret sharing deals with splitting a secret data between several participants. The participants are organized within an access structure consisting of groups that may gain access to the secret. The goal is to provide each participant with a piece of information such that the following two requirements are met: 1. Recoverability: a qualified group can recover the secret, 2. Privacy: any other g...

متن کامل

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)

We consider the model of unconditionally secure (r-round, n-channel) message transmission schemes which was introduced by Dolev et al. [1]. In this model, there are n channels between a sender and a receiver, and an infinitely powerful adversary A may corrupt (observe and forge) the messages sent through t out of n channels. The sender wishes to send a secret s to the receiver in r-round withou...

متن کامل

Weakly-Private Secret Sharing Schemes

Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secret-sharing schemes realizing general access structures is exponential in the number of parties in the access structure, making them impractical. On the other hand, the best lower bound known for sharing of an `-bit secret with re...

متن کامل

Secret Sharing Based On Cartesian product Of Graphs

The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009